Subword complexity and power avoidance
نویسندگان
چکیده
منابع مشابه
Subword complexity and power avoidance
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that – the Thue-Morse word has the minimum possible subword complexity over all overlapfree binary words and all (73)-power-free binary words, but not over all ( 7 3) +-power-free binary words; – the twisted Thue-Morse word has the maximum possible sub...
متن کاملOn scattered subword complexity
Sequences of characters called words or strings are widely studied in combinatorics, and used in various fields of sciences (e.g. chemistry, physics, social sciences, biology [2, 3, 4, 11] etc.). The elements of a word are called letters. A contiguous part of a word (obtained by erasing a prefix or/and a suffix) is a subword or factor. If we erase arbitrary letters from a word, what is obtained...
متن کاملSubword Complexity and k-Synchronization
We show that the subword complexity function ρx(n), which counts the number of distinct factors of length n of a sequence x, is k-synchronized in the sense of Carpi if x is k-automatic. As an application, we generalize recent results of Goldstein. We give analogous results for the number of distinct factors of length n that are primitive words or powers. In contrast, we show that the function t...
متن کاملAsymptotic Subword Complexity
The subword complexity of an infinite word ξ is a function f (ξ, n) returning the number of finite subwords (factors, infixes) of length n of ξ. In the present paper we investigate infinite words for which the set of subwords occurring infinitely often is a regular language. Among these infinite words we characterise those which are eventually recurrent. Furthermore, we derive some results comp...
متن کاملSequences with Subword Complexity 2n G Unter Rote Sequences with Subword Complexity 2n G Unter Rote
Some typographical errors have been corrected. Figure 2 of this report is not complete in this version because it should contain some hand-drawn additional arcs. The reader, however, is able work out the details for herself. Abstract We construct and discuss innnite 0-1-sequences which contain 2n diierent sub-words of length n, for every n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.09.010